MINIMUM PERIOD CONTROL PROBLEM FOR INFINITE DIMENSIONAL SYSTEM

ＭＩＮＩＭＵＭＰＥＲＩＯＤＣＯＮＴＲＯＬＰＲＯＢＬＥＭＦＯＲＩＮＦＩＮＩＴＥＤＩＭＥＮＳＩＯＮＡＬＳＹＳＴＥＭＰＡＨＬＩＰＩＮＧＬＩＸＵＮＪＩＮＧＭａｎｕｓｃｒｉｐｔｒｅｃｅｉｖｅｄＤｅｃｅｍｂｅｒ１２，１９９４．ＲｅｖｉｓｅｄＡｐｒｉｌ１６...     

COHOMOLOGY VANISHING IN HILBERT SPACES

§1. Introduction Oka [40] proved that any additive Cousin problem is solvable in a domain of holomorphyin Cn. Oka [41]-Cartan [2, 3]-Serre [46] generalized this as the theorem B for analyticcoherent sheaves over Stein spaces. J. P. Serre [47] proved…     

一类无穷时滞微分系统的周期解和全局渐近稳定性

利用重合度理论中的延拓定理和微分不等式讨论一类无穷时滞微分系统的周期解的存在性和全局渐近稳定性,获得了简便的判别条件.     

Regular 4‐critical graphs of even degree

In 1960, Dirac posed the conjecture that r‐connected 4‐critical graphs exist for every r ≥ 3. In 1989, Erd?s conjectured that for every r ≥ 3 there exist r‐regular 4‐critical graphs. In this paper, a technique of constructing r‐regular r‐connected vertex‐transitive 4‐critical graphs for even r ≥ 4 is presented. Such graphs are found for r = 6, 8, 10. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 103–130, 2004     

L2×L2中的一类无穷维Hamilton算子的剩余谱

该文得到了一类无穷维Hamilton算子的剩余谱和点谱存在的几个判别准则,从而给出 了求其剩余谱和点谱的方法．在此基础上构造了L2×L2中无穷维Hamilton算子的剩余谱 非空的具体例子,从而进一步验证了判别准则的有效性．     

Minimum Cycle of Row Vector of a Generalized Circulant Fuzzy Matrix

51.IntroductionLetF=[O,1],foranya,beF,definea b=max{a,b},a*b=min{a,b}.Mn(F)standsforthesetofa1lthenthordermatrixesinF,matrixAinMn(F)iscalledFuzzymatrixA.Letrbeanynon-negativeinteger.lnannthordermatrix,exclusiveofthefirstrow,theelementsofeveryotherrowarethee1ementsoftheprecedingrowthatcirculaterightwardr-co1umns.Thisnthordermatrixisannthorderr-circulantFuzzymatrix(alsocalledgenearLizedcirculantFuzzymatrix)-Wecallrthecircu1antindexofr-circulantFuzzymatrix.Inthebooklistedin[1j,thisisgiven:…     

The Method of Fundamental Solutions: A Weighted Least-Squares Approach

We investigate the Method of Fundamental Solutions (MFS) for the solution of certain elliptic boundary value problems. In particular, we study the case in which the number of collocation points exceeds the number of singularities, which leads to an over-determined linear system. In such a case, the resulting linear system is over-determined and the proposed algorithm chooses the approximate solution for which the error, when restricted to the boundary, minimizes a suitably defined discrete Sobolev norm. This is equivalent to a weighted least-squares treatment of the resulting over-determined system. We prove convergence of the method in the case of the Laplace’s equation with Dirichlet boundary data in the disk. We develop an alternative way of implementing the numerical algorithm, which avoids the inherent ill-conditioning of the MFS matrices. Finally, we present numerical experiments suggesting that introduction of Sobolev weights improves the approximation. AMS subject classification (2000) 35E05, 35J25, 65N12, 65N15, 65N35, 65T50     

Contractivity of Bellman operator in risk averse dynamic programming with infinite horizon

The paper deals with a risk averse dynamic programming problem with infinite horizon. First, the required assumptions are formulated to have the problem well defined. Then the Bellman equation is derived, which may be also seen as a standalone reinforcement learning problem. The fact that the Bellman operator is contraction is proved, guaranteeing convergence of various solution algorithms used for dynamic programming as well as reinforcement learning problems, which we demonstrate on the value iteration and the policy iteration algorithms.     

Estimation of IIR Systems with Binary-Valued Observations*

Estimation and control problems with binary-valued observations exist widely in practical systems. However, most of the related works are devoted to finite impulse response (FIR for short) systems, and the theoretical problem of infinite impulse response (IIR for short) systems has been less explored. To study the estimation problems of IIR systems with binary-valued observations, the authors introduce a projected recursive estimation algorithm and analyse its global convergence properties, by using the stochastic Lyapunov function methods and the limit theory on double array martingales. It is shown that the estimation algorithm has similar convergence results as those for FIR systems under a weakest possible non-persistent excitation condition. Moreover, the upper bound for the accumulated regret of adaptive prediction is also established without resorting to any excitation condition.     

无限长圆管非轴对称问题的Donnell理论的解析解

本文根据圆柱壳体的Ｄｏｎｎｅｌｌ近似理论，用富氏积分变换和留数理论得出了无限胀圆管受非轴对称法向荷载的解析解。